A characterization of strongly chordal graphs

نویسندگان

  • Elias Dahlhaus
  • Paul D. Manuel
  • Mirka Miller
چکیده

Elias Dahlhaus Paul D. Manuel y Mirka Miller y Abstract In this paper, we present a simple charactrization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the cycle.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complement of Special Chordal Graphs and Vertex Decomposability

In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.

متن کامل

On Strongly Chordal Graphs That Are Not Leaf Powers

A common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph G = (V,E) is a leaf power if there exist a tree T on leafset V and a threshold k such that uv ∈ E if and only if the distance between u and v in T is at most k. Characterizing leaf powers is a challenging open problem, along with ...

متن کامل

Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone

A graph class is sandwich monotone if, for every pair of its graphs G1 = (V,E1) and G2 = (V,E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \E1 such that G = (V,E1 ∪ {e1, . . . , ei}) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakon...

متن کامل

A Dirac-type characterization of k-chordal graphs

Characterization of k-chordal graphs based on the existence of a simplicial path was shown in [Chvátal et al. Note: Dirac-type characterizations of graphs without long chordless cycles. Discrete Mathematics, 256, 445-448, 2002]. We give a characterization of k-chordal graphs which is a generalization of the known characterization of chordal graphs due to [G. A. Dirac. On rigid circuit graphs. A...

متن کامل

Symmetry properties of chordal rings of degree 3

This paper presents the main properties of chordal rings of degree 3. This family of graphs is strongly related to circulant graphs, which are actually often called chordal rings too. The use of triangles in the plane to represent the vertices allows one to associate a plane tessellation to every chordal ring. By using this geometrical approach, we study the recognition and the isomorphism prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 187  شماره 

صفحات  -

تاریخ انتشار 1998